Small world getting smaller
نویسندگان
چکیده
منابع مشابه
Making a Small World Smaller: Path Optimization in Networks
Reduction of end-to-end network delay is an optimization task with applications in multiple domains. Low delays enable improved information flow in social networks, quick spread of ideas in collaboration networks, low travel times for vehicles on road networks and increased rate of packets in the case of communication networks. Delay reduction can be achieved by both improving the propagation c...
متن کاملSelecting Shortcuts for a Smaller World
The small world phenomenon is a desirable property of social networks, since it guarantees short paths between the nodes of the social graph and thus efficient information spread on the network. It is thus in the benefit of both network users and network owners to enforce and maintain this property. In this work, we study the problem of finding a subset of k edges from a set of candidate edges ...
متن کاملHave you seen ? Small , smaller . . . dendritic spine
Spines are highly motile protrusions emerging from the dendritic shafts of neurons. The dynamics of these postsynaptic structures are ruled by actin filament turnover. However, our understanding of the mechanisms of actin polymerization in dendritic spines is quite ambiguous. A recent study by the Giannone laboratory (Chazeau et al, 2014) is now shedding some light on the peculiar features of a...
متن کاملSmall-world Structure in Children’s Featured Semantic Networks
Background: Knowing the development pattern of children’s language is applicable in developmental psychology. Network models of language are helpful for the identification of these patterns. Objectives: We examined the small-world properties of featured semantic networks of developing children. Materials & Methods: In this longitudinal study, the featured semantic networks of children aged 1...
متن کاملLooking Further Ahead Reveals An Even Smaller World
We improve Kleinberg’s original greedy routing algorithm, and show that if each node can look ahead logk log n depth of its long-range contacts, the routing path can be found with expected length of O(log n logk log n), where n is the size of the network and k is the number of long-range contacts per node. To our knowledge, this is presently the best result for routing messages in Kleinberg’s s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical & Engineering News Archive
سال: 1966
ISSN: 0009-2347,2157-4936
DOI: 10.1021/cen-v044n026.p005